Avoiding conditional branches by code replication

Using Conditional Branches to Improve Constant Propagation

On Conditional Branches in Search Trees

Algorithms for efficiently finding optimal alphabetic decision trees for known probability distributions are well established and commonly used. However, such algorithms generally assume that the cost per decision is uniform and thus independent of the outcome of the decision. The few algorithms without this assumption instead use one cost if the decision outcome is “less than” and another cost...

On Conditional Branches in Optimal Search Trees

Algorithms for efficiently finding optimal alphabetic decision trees — such as the Hu-Tucker algorithm — are well established and commonly used. However, such algorithms generally assume that the cost per decision is uniform and thus independent of the outcome of the decision. The few algorithms without this assumption instead use one cost if the decision outcome is “less than” and another cost...

Coalescing Conditional Branches into Efficient Indirect Jumps

Indirect jumps from tables are traditionally only generated by compilers as an intermediate code generation decision when translating multiway selection statements. However, making this decision during intermediate code generation poses problems. The research described in this paper resolves these problems by using several types of static analysis as a framework for a code improving transformat...

2 Avoiding Code Explosion 2

The \\attening" of nested data-parallelism reduces a very broad class of data-parallel expressions to parallel vector operations. The technique can be understood as the application of a small set of program transformations. In this paper, we explore several practical issues involved in the implementation of these transformations, with an emphasis on the production of optimized vector code.